Vertex Covers and Connected Vertex Covers in 3-connected Graphs
نویسندگان
چکیده
A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively. A connected vertex cover of a graph G is a vertex cover of G such that the subgraph G[N] induced by N of G is connected. The minimum vertex cover problem (VCP) is the problem of finding a vertex cover of minimum cardinal i ty , and the minimum connected vertex cover problem is similarly defined. Time complexity analysis of these problems for 3-connected graphs are the main subject o f the p a p e r .
منابع مشابه
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson [W.H. Freeman & Co., 1979]. Although the optimization and decision variants of finding connected vertex covers of minimum size or weight are well-studied, surprisingly there is no work on the enumeration or maximum number of minimal connected vertex covers of a gr...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملTwo Minimum Dominating Sets with Minimum Intersection in Chordal Graphs
We prove that the problem of nding two minimum dominating sets (connected dominating sets or vertex clique covers) with minimum intersection is linearly solvable in interval graphs. Furthermore, the problem of deciding whether or not there exist two disjoint minimum dominating sets (connected dominating sets or vertex clique covers) is shown to be NP-hard for chordal graphs.
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کامل